Language Without A Central Pushdown Stack
نویسندگان
چکیده
We will attempt to show how human performance limitations on various types of syntactic embedding constructions in Germanic languages can be modelled in a relational network linguistic framework. After arguing against centralized data stores such as pushdown stacks and queues, we will demonstrate how interconnections among levels of linguistic structure can account for many of the psycholinguistic facts.
منابع مشابه
Reachability in pushdown systems: algorithms and applications
This thesis presents reachability algorithms for pushdown systems and their applications to different areas. Roughly speaking, a pushdown system is a stack-based machine whose stack can be unbounded, making it a natural model for sequential programs. Inspired by applications, the thesis analyzes reachability in more generalized pushdown models—alternating pushdown systems and pushdown networks—...
متن کاملA linear time extension of deterministic pushdown automata
A linear time extension of deterministic pushdown automata is introduced that recognizes all deterministic context-free languages, but also languages such as {abc | n ≥ 0} and the MIX language. It is argued that this new class of automata, called λ-acyclic read-first deterministic stack+bag pushdown automata, has applications in natural language processing.
متن کاملStack Transducers for Natural Language Interfaces
We introduce and investigate stack transducers, which are one-way stack automata with an output tape. A one-way stack automaton is a classical pushdown automaton with the additional ability to move the stack head inside the stack without altering the contents. For stack transducers, we distinguish between a digging and a non-digging mode. In digging mode, the stack transducer can write on the o...
متن کاملDeterministic Pda and Simple Languages 1 1
A context-free language is said to be simple if it is accepted by a single-state deterministic pushdown automaton with empty Stack acceptance. This paper proves that it is decidable whether a deterministic pushdown automaton (dpda) accepts a simple language. For this purpose, we prove that it is decidable whether a real-time dpda with empty stack acceptance accepts a simple language. To prove t...
متن کاملExpressive Power of Quantum Pushdown Automata with Classical Stack Operations under the Perfect-Soundness Condition
One important question for quantum computing is whether a computational gap exists between models that are allowed to use quantum effects and models that are not. Several types of quantum computation models have been proposed, including quantum finite automata and quantum pushdown automata (with a quantum pushdown stack). It has been shown that some quantum computation models are more powerful ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1990